Conjugacy separating representations of free groups
نویسندگان
چکیده
منابع مشابه
Groups with Context-Free Conjugacy Problems
The conjugacy problem and the inverse conjugacy problem of a finitely generated group are defined, from a language theoretic point of view, as sets of pairs of words. An automaton might be obliged to read the two input words synchronously, or could have the option to read asynchronously. Hence each class of languages gives rise to four classes of groups; groups whose (inverse) conjugacy problem...
متن کاملA Conjecture about Conjugacy in Free Groups
Say that an element of a free group is a pure conjugate if it can be expressed from the generators using exclusively the conjugacy operation. We study free reductions in words representing pure conjugates. Using finite state automata, we attribute to the letters in such words levels that live in some free left distributive system. If a certain conjecture about this system is true, then reductio...
متن کاملOn Generalised Free Products of Conjugacy Separable Groups
In this paper we prove that a free product of conjugacy separable groups A and B, amalgamating a cyclic subgroup, is conjugacy separable if A and B are subgroup separable, cyclic conjugacy separable, 2-free, and residually p-finite, for all prime numbers p. The following result is an example of the applications we obtain as consequences of our main theorem. Let A and B each be a free product of...
متن کاملFree-by-cyclic Groups Have Solvable Conjugacy Problem
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one of P. Brinkmann that one can determine whether two cyclic words in a free group are mapped to each other by some power of a given automorphism. We also solve ...
متن کاملFree-by-cyclic groups have solvable conjugacy problem
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one of P. Brinkmann that one can determine whether two cyclic words in a free group are mapped to each other by some power of a given automorphism. The algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1973
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1973-0374269-x